Half - Transitive Graphs
نویسنده
چکیده
We explore the relation between vertexand edge-transitivity and arc-transitivity of various graphs. We exhibit several families of graphs whose vertexand edgetransitivity imply arctransitivity. In particular, we show that any vertexand edgetransitive graph with twice a prime number of vertices is arctransitive by simplifying the proof of a theorem by Cheng and Oxley, in which they classify all vertexand edge-transitive graphs of order twice a prime. A graph which is vertexand edgetransitive but not arc-transitive is said to be f-transitive. We present Bouwer's construction, which yields one f -transitive graph for each even degree greater than 2, and exhibit several families of f -transitive metacirculants. In particular, we find a new family of f-transitive metacirculants with 4 blocks.
منابع مشابه
Product of normal edge-transitive Cayley graphs
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
متن کاملTwo-geodesic transitive graphs of prime power order
In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...
متن کاملHalf-Transitive Graphs of Prime-Cube Order
We call an undirected graph X half-transitive if the automorphism group Aut X of X acts transitively on the vertex set and edge set but not on the set of ordered pairs of adjacent vertices of X. In this paper we determine all half-transitive graphs of order p3 and degree 4, where p is an odd prime; namely, we prove that all such graphs are Cayley graphs on the non-Abelian group of order p3 and ...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملHalf-arc-transitive graphs of order 4p of valency twice a prime
A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, but not on arcs. Let p be a prime. Cheng and Oxley [On weakly symmetric graphs of order twice a prime, J. Combin. Theory B 42(1987) 196-211] proved that there is no half-arc-transitive graph of order 2p, and Alspach and Xu [ 12 -transitive graphs of order 3p, J. Algebraic Combin. 3(1994) 347-355] c...
متن کاملOn quartic half-arc-transitive metacirculants
Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ρ and σ , where ρ is (m,n)semiregular for some integers m ≥ 1, n ≥ 2, and where σ normalizes ρ, cyclically permuting the orbits of ρ in such a way that σ has at least one fixed vertex. A halfarc-transitive graph is a vertexand edgebut not arc-transitive graph. In this arti...
متن کامل